Pachner Move 3 –> 3 and Affine Volume-Preserving Geometry in R3

Pachner moves, generic complexity, and randomising 3-manifold triangulations

We study the computational complexity of decision problems on triangulated 3-manifolds. In this setting there has been encouraging initial progress in recent years, but many important questions remain wide open. The “simple” problem of 3-sphere recognition and the related problem of unknot recognition are both known to be in NP, by work of Schleimer [18] and earlier work of Hass, Lagarias and P...

Cover for Volume.13, No.3

Editorial note Volume 6 Issue 3

Basic and Clinical Neuroscience, Volume 4, Number 3, Full Text

3-Move Undeniable Signature Scheme

In undeniable signature schemes, zero-knowledgeness and non-transferability have been identified so far. In this paper, by separating these two notions, we show the first 3-move confirmation and disavowal protocols for Chaum’s undeniable signature scheme which is secure against active and concurrent attacks. Our main observation is that while the signer has one public key and one secret key, th...